Papers with time consumption
LightEA: A Scalable, Robust, and Interpretable Entity Alignment Framework via Three-view Label Propagation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing EA methods inherit the inborn defects from their neural network lineage: poor interpretability and weak scalability. |
| Approach: | They propose a neural-free EA framework that can find equivalent entity pairs between KGs. |
| Outcome: | The proposed framework has impressive scalability, robustness, and interpretability. |
Using active learning to expand training data for implicit discourse relation recognition (D18-1)
Copied to clipboard
| Challenge: | Existing methods to determine semantic relations between text spans are limited in the field of discourse-level relation recognition. |
| Approach: | They propose to expand the training data set using the corpus of explicitly-related arguments by arbitrarily dropping the overtly presented discourse connectives. |
| Outcome: | The proposed model expands the training data set using the corpus of explicitly-related arguments, by arbitrarily dropping the overtly presented discourse connectives. |
LightReasoner: Can Small Language Models Teach Large Language Models Reasoning? (2026.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable progress in reasoning, but are resource-intensive and require large curated datasets. |
| Approach: | They propose a framework that leverages the behavioral divergence between a stronger expert model and a weaker amateur model. |
| Outcome: | The proposed framework improves accuracy by up to 28.1% while reducing time consumption by 90% and tuning token usage by 99%. |
SiMFy: A Simple Yet Effective Approach for Temporal Knowledge Graph Reasoning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for temporal knowledge graph reasoning suffer from low training efficiency and insufficient generalization ability. |
| Approach: | They propose a temporal knowledge graph reasoning approach that uses multilayer perceptron to model the structural dependencies of events and adopts a fixed-frequency strategy to incorporate historical frequency during inference. |
| Outcome: | The proposed model achieves state-of-the-art performance with faster convergence speed and better generalization ability. |
Kernel-Whitening: Overcome Dataset Bias with Isotropic Sentence Embedding (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to reduce dataset bias rely on spurious correlations and obstruct valid feature information while mitigating bias. |
| Approach: | They propose a representation normalization method which disentangles correlations between features of encoded sentences and a kernel approximation method which provides isotropic data distribution. |
| Outcome: | The proposed method eliminates the bias problem by providing isotropic data distribution while maintaining in-distribution accuracy. |
Flooding-X: Improving BERT’s Resistance to Adversarial Attacks via Loss-Restricted Fine-Tuning (2022.acl-long)
Copied to clipboard
Qin Liu, Rui Zheng, Bao Rong, Jingyi Liu, ZhiHua Liu, Zhanzhan Cheng, Liang Qiao, Tao Gui, Qi Zhang, Xuanjing Huang
| Challenge: | Existing approaches to generating adversarial perturbations scale up the cost of training computational complexity by the number of gradient steps it takes to obtain the adversarials. |
| Approach: | They propose a flood method which aims at better generalization and a criterion to bring hyper-parameter-dependent flooding into effect with a narrowed-down search space by measuring how the gradient steps taken within one epoch affect the loss of each batch. |
| Outcome: | The proposed method improves BERT’s resistance to textual adversarial attacks by a large margin and achieves state-of-the-art robust accuracy on various text classification and GLUE tasks. |
PARSE: An Efficient Search Method for Black-box Adversarial Text Attacks (2022.coling-1)
Copied to clipboard
| Challenge: | Neural networks are vulnerable to adversarial examples, i.e., under a black-box scenario. |
| Approach: | They propose a word-level search algorithm that searches for subareas under dynamic search space following the subarea importance. |
| Outcome: | The proposed algorithm can achieve comparable success rates to complex search methods while saving numerous queries and time. |
MASTER: A Multi-Agent System with LLM Specialized MCTS (2025.naacl-long)
Copied to clipboard
Bingzheng Gan, Yufan Zhao, Tianyi Zhang, Jing Huang, Li Yusu, Shu Xian Teo, Changwang Zhang, Wei Shi
| Challenge: | Large Language Models (LLMs) are increasingly being explored for problem-solving tasks . their strategic planning capability is often viewed with skepticism due to their limited planning capabilities. |
| Approach: | They propose a framework that coordinates agent recruitment and communication through LLM specialized MCTS. |
| Outcome: | The proposed framework achieves 76% accuracy on HotpotQA and 80% on WebShop . it relies on extensive sampling simulations to approximate the true reward distribution . |
DSRM: Boost Textual Adversarial Training with Distribution Shift Risk Minimization (2023.acl-long)
Copied to clipboard
| Challenge: | Existing adversarial training methods require multi-step gradient ascents or word substitutions to obtain adversarials, which impairs the effectiveness of adversariarial training. |
| Approach: | They propose a procedure for instead adversarial training with only clean data that estimates the adversarials loss by perturbing the input data’s probability distribution rather than their embeddings. |
| Outcome: | The proposed procedure reduces time consumption by up to 70% compared to current best-performing adversarial training methods. |
Leveraging Estimated Transferability Over Human Intuition for Model Selection in Text Ranking (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for text ranking are based on intuition, but their estimated transferability may not align well with the objectives of text ranking. |
| Approach: | They propose to compute expected rank as transferability, explicitly reflecting the model’s ranking capability. |
| Outcome: | The proposed method shows significant improvements over previous classification-oriented TE methods, human intuition, and ChatGPT with minor time consumption. |
AnalyticKWS: Towards Exemplar-Free Analytic Class Incremental Learning for Small-footprint Keyword Spotting (2025.findings-acl)
Copied to clipboard
| Challenge: | Keyword spotting (KWS) is a useful mechanism to identify spoken commands in voice-enabled systems, but catastrophic forgetting is causing models to lose their ability to recognize earlier keywords. |
| Approach: | They propose an exemplar-free method that updates model parameters without revisiting earlier data. |
| Outcome: | The proposed method outperforms existing continual learning methods on a variety of datasets and settings. |
On the Universal Adversarial Perturbations for Efficient Data-free Adversarial Detection (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing adversarial detection methods require access to training data, which brings noteworthy concerns regarding privacy leakage and generalizability. |
| Approach: | They propose a data-agnostic adversarial detection framework which induces different responses between normal and adversarials to UAPs. |
| Outcome: | The proposed framework achieves competitive detection performance on various text classification tasks, and maintains equivalent time consumption to normal inference. |
RepoDebug: Repository-Level Multi-Task and Multi-Language Debugging Evaluation of Large Language Models (2025.findings-emnlp)
Copied to clipboard
Jingjing Liu, Zeming Liu, Zihao Cheng, Mengliang He, Xiaoming Shi, Yuhang Guo, Xiangrong Zhu, Yuanfang Guo, Yunhong Wang, Haifeng Wang
| Challenge: | Large Language Models (LLMs) have exhibited significant proficiency in code debugging, especially in automatic program repair. |
| Approach: | They propose a repository-level code debugging dataset with 22 subtypes of errors that supports 8 commonly used programming languages and 3 debug tasks. |
| Outcome: | The proposed dataset supports 8 commonly used programming languages and 3 debugging tasks. |
HiChunk: Evaluating and Enhancing Retrieval Augmented Generation with Hierarchical Chunking (2026.acl-long)
Copied to clipboard
| Challenge: | Existing evaluation benchmarks for document chunking are inadequate due to evidence sparsity . evaluators are unable to evaluate different chunking methods due to the evidence sparing . |
| Approach: | They propose a QA benchmark for document chunking and a hierarchical document structuring framework for it. |
| Outcome: | The proposed framework improves document chunking quality within reasonable time consumption. |